TSTP Solution File: NUM699^1 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 7 08:00:34 EDT 2024
% Result : Theorem 2.62s 1.56s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 18 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 12 ( 2 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 35 ( 2 ~; 0 |; 0 &; 31 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_type,type,
x: nat ).
thf(y_type,type,
y: nat ).
thf(less_type,type,
less: nat > nat > $o ).
thf(lessis_type,type,
lessis: nat > nat > $o ).
thf(suc_type,type,
suc: nat > nat ).
thf(pl_type,type,
pl: nat > nat > nat ).
thf(n_1_type,type,
n_1: nat ).
thf(1,conjecture,
lessis @ ( suc @ y ) @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25c) ).
thf(2,negated_conjecture,
~ ( lessis @ ( suc @ y ) @ x ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ( lessis @ ( suc @ y ) @ x ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
less @ y @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
thf(7,plain,
less @ y @ x,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: nat,B: nat] :
( ( less @ B @ A )
=> ( lessis @ ( pl @ B @ n_1 ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz25b) ).
thf(8,plain,
! [A: nat,B: nat] :
( ( less @ B @ A )
=> ( lessis @ ( pl @ B @ n_1 ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: nat] :
( ( pl @ A @ n_1 )
= ( suc @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4a) ).
thf(10,plain,
! [A: nat] :
( ( pl @ A @ n_1 )
= ( suc @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
$false,
inference(e,[status(thm)],[6,7,8,10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM699^1 : TPTP v8.1.2. Released v3.7.0.
% 0.14/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n016.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 6 12:21:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.94/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.26/0.98 % [INFO] Parsing done (117ms).
% 1.26/0.99 % [INFO] Running in sequential loop mode.
% 1.72/1.20 % [INFO] eprover registered as external prover.
% 1.72/1.20 % [INFO] cvc4 registered as external prover.
% 1.72/1.21 % [INFO] Scanning for conjecture ...
% 1.85/1.25 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.85/1.27 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.85/1.28 % [INFO] Problem is higher-order (TPTP THF).
% 1.85/1.29 % [INFO] Type checking passed.
% 1.85/1.29 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.62/1.56 % External prover 'e' found a proof!
% 2.62/1.56 % [INFO] Killing All external provers ...
% 2.62/1.56 % Time passed: 1027ms (effective reasoning time: 567ms)
% 2.62/1.56 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.62/1.56 % Axioms used in derivation (3): l, satz25b, satz4a
% 2.62/1.56 % No. of inferences in proof: 10
% 2.62/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1027 ms resp. 567 ms w/o parsing
% 2.62/1.58 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.58 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------